On k-Maximal Strength Digraphs
نویسندگان
چکیده
Let k > 0 be an integer and let D be a simple digraph on n > k vertices. We prove that If |A(D)| > k(2n − k − 1)+ ( n − k 2 )
منابع مشابه
On the lower bound of k-maximal digraphs
For a digraph D, let λ(D) be the arc-strong-connectivity of D. For an integer k > 0, a simple digraph Dwith |V (D)| ≥ k + 1 is k-maximal if every subdigraph H of D satisfies λ(H) ≤ k but for adding new arc to D results in a subdigraph H ′ with λ(H ) ≥ k + 1. We prove that if D is a simple k-maximal digraph on n > k + 1 ≥ 2 vertices, then |A(D)| ≥ n 2 + (n − 1)k + n k + 2 1 + 2k − k +...
متن کاملThe power digraphs of safe primes
A power digraph, denoted by $G(n,k)$, is a directed graph with $Z_{n}={0,1,..., n-1}$ as the set of vertices and $L={(x,y):x^{k}equiv y~(bmod , n)}$ as the edge set, where $n$ and $k$ are any positive integers. In this paper, the structure of $G(2q+1,k)$, where $q$ is a Sophie Germain prime is investigated. The primality tests for the integers of the form $n=2q+1$ are established in terms of th...
متن کاملOn maximal actions and w-maximal actions of finite hypergroups
Sunder and Wildberger (J. Algebr. Comb. 18, 135–151, 2003) introduced the notion of actions of finite hypergroups, and studied maximal irreducible actions and *-actions. One of the main results of Sunder and Wildberger states that if a finite hypergroup K admits an irreducible action which is both a maximal action and a *action, then K arises from an association scheme. In this paper we will fi...
متن کاملOn the Energy of Bicyclic Signed Digraphs
Among unicyclic digraphs and signed digraphs with fixed number of vertices, the digraphs and signed digraphs with minimal and maximal energy are already determined. In this paper we address the problem of finding bicyclic signed digraphs with extremal energy. We obtain minimal and maximal energy among all those n -vertex bicyclic signed digraphs which contain vertex-disjoint signed directed cyc...
متن کاملMore skew-equienergetic digraphs
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 84 شماره
صفحات -
تاریخ انتشار 2017